Перевод: с русского на все языки

binary Horn clause

Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Schaefer's dichotomy theorem — In computational complexity theory, a branch of computer science, Schaefer s theorem states necessary and sufficient conditions under which a set O of Boolean operators generate polynomial time or NP complete problems when some of the operators… … Wikipedia
Relational algebra — Not to be confused with Relation algebra. Relational algebra, an offshoot of first order logic (and of algebra of sets), deals with a set of finitary relations (see also relation (database)) that is closed under certain operators. These operators … Wikipedia
List of Latin words with English derivatives — This is a list of Latin words with derivatives in English (and other modern languages). Ancient orthography did not distinguish between i and j or between u and v. Many modern works distinguish u from v but not i from j. In this article both… … Wikipedia